FORTRAN 77 Subroutines for the Solution of Skew-Hamiltonian/Hamiltonian Eigenproblems - Part II: Implementation and Numerical Results
نویسندگان
چکیده
Skew-Hamiltonian/Hamiltonian matrix pencils λS −H appear in many applications, including linear quadratic optimal control problems, H∞-optimization, certain multi-body systems and many other areas in applied mathematics, physics, and chemistry. In these applications it is necessary to compute certain eigenvalues and/or corresponding deflating subspaces of these matrix pencils. Recently developed methods exploit and preserve the skew-Hamiltonian/Hamiltonian structure and hence increase reliability, accuracy and performance of the computations. In this paper we describe the implementation of the algorithms in the style of subroutine included in the Subroutine Library in Control Theory (SLICOT) described in Part I of this work [7] and address various details. Furthermore, we perform numerical tests using real-world examples to demonstrate the superiority of the new algorithms compared to standard methods.
منابع مشابه
Fortran 77 Subroutines for Computing the Eigenvalues of Hamiltonian Matrices II
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces of Hamiltonian and skew-Hamiltonian matrices. The implemented algorithms are based on orthogonal symplectic decompositions, implying numerical backward stability as well as symmetry preservation for the computed eigenvalues. These algorithms are supplemented with balancing and block algorithms, which...
متن کاملSLICOT Working Note 2013-3 MB04BV A FORTRAN 77 Subroutine to Compute the Eigenvectors Associated to the Purely Imaginary Eigenvalues of Skew-Hamiltonian/Hamiltonian Matrix Pencils
We implement a structure-preserving numerical algorithm for extracting the eigenvectors associated to the purely imaginary eigenvalues of skew-Hamiltonian/Hamiltonian matrix pencils. We compare the new algorithm with the QZ algorithm using random examples with di erent di culty. The results show that the new algorithm is signi cantly faster, more robust, and more accurate, especially for hard e...
متن کاملFortran 77 Subroutines for Computing the Eigenvalues of Hamiltonian Matrices I: the Square Reduced Method
This paper describes LAPACK-based Fortran 77 subroutines for the reduction of a Hamiltonian matrix to square-reduced form and the approximation of all its eigenvalues using the implicit version of Van Loan's method. The transformation of the Hamiltonian matrix to a square-reduced form transforms a Hamiltonian eigenvalue problem of order 2n to a Hessenberg eigenvalue problem of order n. The eige...
متن کاملSymplectic and symmetric methods for the numerical solution of some mathematical models of celestial objects
In the last years, the theory of numerical methods for system of non-stiff and stiff ordinary differential equations has reached a certain maturity. So, there are many excellent codes which are based on Runge–Kutta methods, linear multistep methods, Obreshkov methods, hybrid methods or general linear methods. Although these methods have good accuracy and desirable stability properties such as A...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013